Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
نویسندگان
چکیده
The NP-hard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings such that both partitions use exactly the same substrings in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter k.
منابع مشابه
Parameterized tractability of the maximum-duo preservation string mapping problem
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reductio...
متن کاملA Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
Motivated by the study of genome rearrangements, the NPhard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced strings, so that some elements may not be covered by any block. We present an efficient fixed-parameter algorithm for the parameters number k of blocks and maxim...
متن کاملWhat Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected subgraph, and the partitions differ in size by at most one. We examine the problem from the parameterized complexity perspective with respect to the number of partitions, the treewidth, the pathwidth, the size of a minim...
متن کاملA Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
Given an input consisting of an n-vertex convex polygon with k hole vertices or an n-vertex planar straight line graph (PSLG) with k holes and/or reflex vertices inside the convex hull, the parameterized minimum number convex partition (MNCP) problem asks for a partition into a minimum number of convex pieces. We give a fixedparameter tractable algorithm for this problem that runs in the follow...
متن کاملThe complexity of the matroid-greedoid partition problem
We show that the maximum matroid-greedoid partition problem is NP-hard to approximate to within 1/2 + ε for any ε > 0, which matches the trivial factor 1/2 approximation algorithm. The main tool in our hardness of approximation result is an extractor code with polynomial rate, alphabet size and list size, together with an efficient algorithm for list-decoding. We show that the recent extractor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014